Also Solved
نویسندگان
چکیده
Furthermore, by using [2, p. 230, (1)] a computable representation for the G-function in (1) (and hence also for F,112(s)) may be given in terms of essentially a linear combination of four hypergeometric functions OF3[b2s2 /16] provided that no two of the parameters {1, 1 1+v-P1v-P) differ by an integer. This result for Fv-112(s) is given (correctly) in [3, p. 353, (9)] so that the proposed integral is in fact already tabulated in terms of known computable functions.
منابع مشابه
OPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
متن کاملConjugate problem of combined radiation and laminar forced convection separated flow
This paper presents a numerical investigation for laminar forced convection flow of a radiating gas in a rectangular duct with a solid element that makes a backward facing step. The fluid is treated as a gray, absorbing, emitting and scattering medium. The governing differential equations consisting the continuity, momentum and energy are solved numerically by the computational fluid dynamics t...
متن کاملEstimation of Software Reliability by Sequential Testing with Simulated Annealing of Mean Field Approximation
Various problems of combinatorial optimization and permutation can be solved with neural network optimization. The problem of estimating the software reliability can be solved with the optimization of failed components to its minimum value. Various solutions of the problem of estimating the software reliability have been given. These solutions are exact and heuristic, but all the exact approach...
متن کاملAn Optimization via Simulation approach for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems
In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...
متن کاملExact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...
متن کاملA Multi Objective Geometric Programming Model for Optimal Production and Marketing Planning
This paper presents a multi objective geometric programming model which determines the product`s selling price in two markets. We assume demand is a function of price and marketing expenditure in two markets. The cost of production is also assumed to be a function of demands in both markets. Our model is a posynomial function which is solved using Geometric Programming (GP). In our GP implement...
متن کامل